Complexity of Manipulative Attacks in Judgment Aggregation for Premise-Based Quota Rules1

Endriss et al. [26] initiated the complexity-theoretic study of problems related to judgment aggregation. We extend their results for manipulating two specific judgment aggregation procedures to a whole class of such procedures, namely to uniform premise-based quota rules. In addition, we consider incomplete judgment sets and the notions of top-respecting and closeness-respecting preferences introduced by Dietrich and List [21]. This complements previous work on the complexity of manipulation in judgment aggregation that focused on Hamming-distance-induced preferences only, which we also study here. We also introduce the notion of control by bundling judges and study it in terms of its computational complexity.